Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
نویسندگان
چکیده
This paper deals with a general combinatorial optimization problem in which closed intervals and fuzzy intervals model uncertain element weights. The notion of a deviation interval is introduced, which allows us to characterize the optimality and the robustness of solutions and elements. The problem of computing deviation intervals is addressed and some new complexity results in this field are provided. Possibility theory is then applied to generalize a deviation interval and a solution concept to fuzzy ones.
منابع مشابه
Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
In this chapter we discuss a wide class of combinatorial optimization problems with a linear sum and a bottleneck cost function. We first investigate the case when the weights in the problem are modeled as closed intervals. We show how the notion of optimality can be extended by using a concept of a deviation interval. In order to choose a solution we adopt a robust approach. We seek a solution...
متن کاملA Possibilistic Approach to Bottleneck Combinatorial Optimization Problems with Ill-Known Weights
In this paper a general bottleneck combinatorial optimization problem with uncertain element weights modeled by fuzzy intervals is considered. A rigorous possibilistic formalization of the problem and solution concepts in this setting that lead to finding robust solutions under fuzzy weights are given. Some algorithms for finding a solution according to the introduced concepts and evaluating op...
متن کاملRandomized Minmax Regret for Combinatorial Optimization Under Uncertainty
The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs with the intention of maximizing the regret of the player. Existing minmax regret models consider only deterministic solutions/strategies, and minmax regret...
متن کاملSome methods for evaluating the optimality of elements in matroids with ill-known weights
In this paper the class of matroidal combinatorial optimization problems with imprecise weights of elements is considered. The imprecise weights are modeled by intervals and fuzzy intervals. The concepts of possible and necessary optimality under imprecision are recalled. Some efficient methods for evaluating the possible and necessary optimality of elements in the interval-valued problems are ...
متن کاملUsing Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems
In this paper a general approach to combinatorial optimization problems with fuzzy weights is discussed. The results, valid for the interval-valued problems, are extended to the fuzzy-valued ones by exploiting the very recent notion of a gradual number. Some methods for determining the exact degrees of possible and necessary optimality and the possibility distributions of deviations of solution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 200 شماره
صفحات -
تاریخ انتشار 2010